class Solution:
    # def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
    def merge(self, nums1, m, nums2, n):
        while True:
            if m > 0 and n > 0:
                nums1[m + n - 1] = max(nums1[m - 1], nums2[n - 1])
                if nums1[m - 1] > nums2[n - 1]:
                    nums1[m + n - 1] = nums1[m - 1]
                    m -= 1
                else:
                    nums1[m + n - 1] = nums2[n - 1]
                    n -= 1
            elif n > 0 and m == 0:
                nums1[n - 1] = nums2[n - 1]
                n -= 1
            else:
                break
